The Impact of Contention Resolution verses a priori Channel Allocation on Latency in a Delay Constrained Network

نویسندگان

  • John Gibson
  • Geoffrey G. Xie
  • José Coelho
  • Leopoldo Diaz-Gonzalez
چکیده

The predominant mechanism used to control access to the underwater acoustic channel is a contention-based collision-avoidance scheme to reserve the shared media, on-demand, before sending data to avoid retransmission costs incurred with collisions. This paper reports analysis of such a mechanism for a simple linear, or backbone, type topology as compared to the use of an a priori allocation of capacity to each host, thereby eliminating the need for such access coordination. The former incurs RTS/CTS propagation overhead while the latter incurs a transmission penalty due to the reduced transmission rate of each allocated channel. Therefore, the selection of an appropriate access mechanism, given consideration of the message size and the propagation distance, may have a significant impact on the overall latency of a message. In particular, given the topology modeled for the study, this paper suggests that relatively small messages or long propagation distances benefit from an a priori channel allocation, while large messages or short distances are more effectively served by an access coordination method, such as RTS-CTS exchanges. Further, as the number of frames in a message or the number of hops over which the message is relayed increases the relative latency performance of the a priori allocation improves over that of the coordinated access. The results establish a prior channel allocation as an appealing media access scheme in delay constrained networks and should provide an impetus for further research so as to maximize the performance potential of such schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congestion estimation of router input ports in Network-on-Chip for efficient virtual allocation

Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...

متن کامل

Constrained consumable resource allocation in alternative stochastic networks via multi-objective decision making

Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...

متن کامل

Achieving Delay Guarantees in Ad Hoc Networks Using Distributed Contention Window Adaptation

In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad hoc networks. By adapting the contention window sizes of IEEE 802.11, DDA schedules packets of flows according to their individual delay requirements. The novelty of DDA is that it imposes no control message overhead on t...

متن کامل

The Effects of Network Contention on Processor Allocation Strategies

Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important....

متن کامل

On contention resolution in the data vortex optical interconnection network

Alternative contention resolution techniques are studied in the data vortex interconnection network, namely, the insertion of fiber-delay-line (FDL) buffers into the switching nodes. The performance of each technique is evaluated according to relevant performance metrics: acceptance rate, mean latency, and latency variance. A detailed discussion concludes that while traditional data vortex netw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006